CS - - 1994 - - 09 Arithmetic Coding for Data Compression
نویسندگان
چکیده
منابع مشابه
A fast and efficient compression method for binary images
The use of arithmetic coding for binary image compression achieves a high compression ratio while the running time remains rather slow. A composite modelling method presented in this paper reduces the size of the data to be coded by arithmetic coding. The method is to code the uniform areas with less computation and apply arithmetic coding to the areas with more variation.
متن کاملBit-Wise Arithmetic Coding for Data Compression
This article examines the problem of compressing a uniformly quantized IID source. We present a new compression technique, bit-wise arithmetic coding, that assigns xed length codewords to the quantizer output and uses arithmetic coding to compress the codewords, treating the codeword bits as independent. We examine the performance of this method and evaluate the overhead required when used bloc...
متن کاملArchitectural Advances in the VLSI Implementation of Arithmetic Coding for Binary Image Compression
This paper presents some recent advances in the architecture for the data compression technique known as Arithmetic Coding. The new architecture employs loop unrolling and speculative execution of the inner loop of the algorithm to achieve a significant speed-up relative to the Q-Coder architecture. This approach reduces the number of iterations required to compress a block of data by a factor ...
متن کاملData compression of scanned halftone images
A new method for coding scanned halftone images is proposed. It is information-lossy, but still preserving the image quality, compression rates of 16-35 have been achieved for a typical test image scanned on a high resolution scanner. The bi-level halftone images are filtered, in phase with the halftone grid, and converted to a gray level representation. A new digital description of (halftone) ...
متن کاملModified constant modulus algorithm for blind DS/CDMA detection
1 OKTEM, L., and ASTOLA, J.: 'Hierarchical enumerative coding of locally stationary binary data', Electron. Lett., 1999, 35, (17), pp. 1428-1429 2 COVER, T.M.: 'Enumerative source encoding', IEEE Trans. Inf. Theory, 1973, IT-19, (1), pp. 73-77 3 WELCH, T.A.: 'A technique for high-performance data compression', IEEE Comput., 1984, 17, (6), pp. 8-19 4 MOFFAT, A., NEAL, R., and wiTTEN, I.H.: 'Arit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994